Slicing techniques for verification re-use

نویسنده

  • Heike Wehrheim
چکیده

In this paper we discuss which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specifically, we will investigate when a temporal logic property of an Object-Z class is preserved under a modification or extension of the class with new features. To this end, we use the slicing technique from program analysis which provides us with a representation of the dependencies within the class in the form of a program dependence graph. This graph can be used to determine the effect of a change to the class’s behaviour and thus to the validity of a temporal logic formula.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Property-based Slicing for Agent Verification

Programming languages designed specifically for multi-agent systems represent a new programming paradigm that has gained popularity over recent years, with some multi-agent programming languages being used in increasingly sophisticated applications, often in critical areas. To support this, we have developed a set of tools to allow the use of model-checking techniques in the verification of sys...

متن کامل

Microprocessor Verification using RT-Level Static Analysis Techniques

We present a technique for automatic verification of pipelined microprocessors using model checking. Antecedent conditioned slicing is an efficient abstraction technique for hardware designs at the Register Transfer Level (RTL). Antecedent conditioned slicing prunes the verification state space, using information from the antecedent of a given LTL property. In this work, we model instructions o...

متن کامل

Slicing Software for Model Construction

Applying nite state veri cation techniques e g model check ing to software requires that program source code be trans lated to a nite state transition system that safely models program behavior Automatically checking such a transition system for a correctness property is typically very costly thus it is necessary to reduce the size of the transition sys tem as much as possible In fact it is oft...

متن کامل

Deductive Verification for Improving Slicing of Integrated Formal Specifications

The combination of the two well known formal specification techniques CSP [Hoa85] for behavioural aspects of systems and Object-Z (OZ) [Smi00] for data aspects of systems into the specification language CSPOZ [Fis97] has already been subject of intense research. An important challenge, especially when trying to automatically or semi-automatically analyse such specifications, is their inherent c...

متن کامل

Static program transformations for efficient software model checking

Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checking suffers from the state space explosion problem. Abstraction is emerging as the key candidate for making the model checking problem tractable, and a large body of research exists on abstraction based verification. Many useful abstractions are p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 343  شماره 

صفحات  -

تاریخ انتشار 2005